- recursive algorithms
- Программирование: рекурсивные алгоритмы
Универсальный англо-русский словарь. Академик.ру. 2011.
recursive algorithms
Смотреть что такое "recursive algorithms" в других словарях:
Algorithms + Data Structures = Programs — is a book written by Niklaus Wirth covering some of the fundamental topics of computer programming. The book was published by Prentice Hall in 1976 [ [http://portal.acm.org/citation.cfm?id=540029 Algorithms + Data Structures = Programs] ] and is… … Wikipedia
Recursive least squares filter — Recursive least squares (RLS) algorithm is used in adaptive filters to find the filter coefficients that relate to recursively producing the least squares (minimum of the sum of the absolute squared) of the error signal (difference between the… … Wikipedia
Recursive acronym — A recursive acronym (synonymous with metacronym,[1] recursive initialism, and recursive backronym) is an acronym or initialism that refers to itself in the expression for which it stands. The term was first used in print in April 1986.[2]… … Wikipedia
Recursive descent parser — A recursive descent parser is a top down parser built from a set of mutually recursive procedures (or a non recursive equivalent) where each such procedure usually implements one of the production rules of the grammar. Thus the structure of the… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
co-recursive — adjective Describing a definition, particularly of an algorithm, given in terms of its output, rather than its input. Co recursive algorithms allow infinite large objects to be used without necessarily running out of memory. See Also: corecursion … Wiktionary
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … Wikipedia
